Waiting strategies for the dynamic dial-a-ride problemYUEN, C. W; WONG, K. I; HAN, Anthony F et al.International journal of environment and sustainable development. 2009, Vol 8, Num 3-4, pp 314-329, issn 1474-6778, 16 p.Article

Dynamic pickup and delivery problemsBERBEGLIA, Gerardo; CORDEAU, Jean-François; LAPORTE, Gilbert et al.European journal of operational research. 2010, Vol 202, Num 1, pp 8-15, issn 0377-2217, 8 p.Article

Variable neighborhood search for the dial-a-ride problemPARRAGH, Sophie N; DOERNER, Karl F; HARTL, Richard F et al.Computers & operations research. 2010, Vol 37, Num 6, pp 1129-1138, issn 0305-0548, 10 p.Article

A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraintsZHIHAI XIANG; CHENGBIN CHU; HAOXUN CHEN et al.European journal of operational research. 2006, Vol 174, Num 2, pp 1117-1139, issn 0377-2217, 23 p.Article

A tabu search heuristic for the static multi-vehicle dial-a-ride problemCORDEAU, Jean-Francois; LAPORTE, Gilbert.Transportation research. Part B : methodological. 2003, Vol 37, Num 6, pp 579-594, issn 0191-2615, 16 p.Article

Optimization of occupancy rate in dial-a-ride problems via linear fractional column generationGARAIX, Thierry; ARTIGUES, Christian; FEILLET, Dominique et al.Computers & operations research. 2011, Vol 38, Num 10, pp 1435-1442, issn 0305-0548, 8 p.Article

A Heuristic Two-Phase Solution Approach for the Multi-Objective Dial-A-Ride ProblemPARRAGH, Sophie N; DOERNER, Karl F; HARTL, Richard F et al.Networks (New York, NY). 2009, Vol 54, Num 4, pp 227-242, issn 0028-3045, 16 p.Conference Paper

Combining multicriteria analysis and tabu search for dial-a-ride problemsPAQUETTE, Julie; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Transportation research. Part B : methodological. 2013, Vol 52, pp 1-16, issn 0191-2615, 16 p.Article

The Dial-A-Ride Problem with TransfersMASSON, Renaud; LEHUEDE, Fabien; PETON, Olivier et al.Computers & operations research. 2014, Vol 41, pp 12-23, issn 0305-0548, 12 p.Article

An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delaysHEILPORN, Géraldine; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Discrete applied mathematics. 2011, Vol 159, Num 9, pp 883-895, issn 0166-218X, 13 p.Article

A Granular Tabu Search algorithm for the Dial-a-Ride ProblemKIRCHLER, Dominik; WOLFLER CALVO, Roberto.Transportation research. Part B : methodological. 2013, Vol 56, pp 120-135, issn 0191-2615, 16 p.Article

On-line single-server dial-a-ride problemsFEUERSTEIN, Esteban; STOUGIE, Leen.Theoretical computer science. 2001, Vol 268, Num 1, pp 91-105, issn 0304-3975Conference Paper

A note on Efficient feasibility testing for dial-a-ride problemsIIAFU TANG; YUAN KONG; LAU, Henrv et al.Operations research letters. 2010, Vol 38, Num 5, pp 405-407, issn 0167-6377, 3 p.Article

The heterogeneous pickup and delivery problem with configurable vehicle capacityYUAN QU; BARD, Jonathan F.Transportation research. Part C, Emerging technologies. 2013, Vol 32, pp 1-20, issn 0968-090X, 20 p.Conference Paper

The study of a dynamic dial-a-ride problem under time-dependent and stochastic environmentsZHIHAI XIANG; CHENGBIN CHU; HAOXUN CHEN et al.European journal of operational research. 2008, Vol 185, Num 2, pp 534-551, issn 0377-2217, 18 p.Article

Checking the Feasibility of Dial-a-Ride Instances Using Constraint ProgrammingBERBEGLIA, Gerardo; PESANT, Gilles; ROUSSEAU, Louis-Martin et al.Transportation science. 2011, Vol 45, Num 3, pp 399-412, issn 0041-1655, 14 p.Article

A stochastic model for a vehicle in a dial-a-ride systemHYYTIÄ, E; AALTO, S; PENTTINEN, A et al.Operations research letters. 2010, Vol 38, Num 5, pp 432-435, issn 0167-6377, 4 p.Article

Hybrid column generation and large neighborhood search for the dial-a-ride problemPARRAGH, Sophie N; SCHMID, Verena.Computers & operations research. 2013, Vol 40, Num 1, pp 490-497, issn 0305-0548, 8 p.Article

A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windowsDIANA, Marco; DESSOUKY, Maged M.Transportation research. Part B : methodological. 2004, Vol 38, Num 6, pp 539-557, issn 0191-2615, 19 p.Article

An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windowsHÄME, Lauri.European journal of operational research. 2011, Vol 209, Num 1, pp 11-22, issn 0377-2217, 12 p.Article

A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large cityMUELAS, Santiago; LATORRE, Antonio; PEÑA, José-María et al.Expert systems with applications. 2013, Vol 40, Num 14, pp 5516-5531, issn 0957-4174, 16 p.Article

A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information ConstraintsWAISANEN, Holly A; SHAH, Devavrat; DAHLEH, Munther A et al.IEEE transactions on automatic control. 2008, Vol 53, Num 6, pp 1419-1433, issn 0018-9286, 15 p.Article

Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transportsSCHILDE, M; DOERNER, K. F; HARTL, R. F et al.Computers & operations research. 2011, Vol 38, Num 12, pp 1719-1730, issn 0305-0548, 12 p.Article

Vehicle routing problems with alternative paths: An application to on-demand transportationGARAIX, Thierry; ARTIGUES, Christian; FEILLET, Dominique et al.European journal of operational research. 2010, Vol 204, Num 1, pp 62-75, issn 0377-2217, 14 p.Article